Adaptive Fourier series—a variation of greedy algorithm
نویسندگان
چکیده
منابع مشابه
Adaptive Fourier series - a variation of greedy algorithm
We study decomposition of functions in the Hardy space H2(D) into linear combinations of the basic functions (modified Blaschke products) in the system Bn(z) = √ 1 − |an|2 1 − anz n−1 ∏ k=1 z − ak 1 − akz , n = 1, 2, ..., (1) where the points an’s in the unit disc D are adaptively chosen in relation to the function to be decomposed. The chosen points an’s do not necessarily satisfy the usually ...
متن کاملA Sparse Greedy Self-Adaptive Algorithm for Classification of Data
Kernels have become an integral part of most data classification algorithms. However the kernel parameters are generally not optimized during learning. In this work a novel adaptive technique called Sequential Function Approximation (SFA) has been developed for classification that determines the values of the control and kernel hyper-parameters during learning. This tool constructs sparse radia...
متن کاملParallel Greedy Adaptive Search Algorithm for Steiner Tree Problem
In this paper, a parallel algorithm for the Steiner tree problem is presented. The algorithm is based on the well-known multi-start paradigm the GRASP and the well-known proximity structures from computational geometry. The main contribution of this paper is the O(n log n+log n log( n log n )) parallel algorithm for computing Steiner tree on the Euclidean plane. The parallel algorithm used prox...
متن کاملSparse Signals Reconstruction via Adaptive Iterative Greedy Algorithm
Compressive sensing(CS) is an emerging research field that has applications in signal processing, error correction, medical imaging, seismology, and many more other areas. CS promises to efficiently reconstruct a sparse signal vector via a much smaller number of linear measurements than its dimension. In order to improve CS reconstruction performance, this paper present a novel reconstruction g...
متن کاملAdaptive Greedy Algorithm With Application to Nonlinear Communications
Greedy algorithms form an essential tool for compressed sensing. However, their inherent batch mode discourages their use in time-varying environments due to significant complexity and storage requirements. In this paper a powerful greedy scheme developed in [1], [2], is converted into an adaptive algorithm which is applied to estimation of a class of nonlinear communication systems. Performanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Computational Mathematics
سال: 2010
ISSN: 1019-7168,1572-9044
DOI: 10.1007/s10444-010-9153-4